A Hybrid Heuristic/Deterministic Dynamic Programing Technique for Fast Sequence Alignment
نویسندگان
چکیده
منابع مشابه
A Hybrid Heuristic/Deterministic Dynamic Programing Technique for Fast Sequence Alignment
Dynamic programming seeks to solve complex problems by breaking them down into multiple smaller problems. The solutions of these smaller problems are then combined to reach the overall solution. Deterministic algorithms have the advantage of accuracy but they need large computational power requirements. Heuristic algorithms have the advantage of speed but they provide less accuracy. This paper ...
متن کاملFast A Algorithms for Multiple Sequence Alignment
The multiple alignment of the sequences of DNA and proteins is applicable to various important elds in molecular biology. Although the approach based on Dynamic Programming is well-known for this problem, it requires enormous time and space to obtain the optimal alignment. On the other hand, this problem corresponds to the shortest path problem and the A algorithm, which can e ciently nd the sh...
متن کاملA Design of a Hybrid System for DNA Sequence Alignment
This paper describes a parallel algorithm and its needed architecture and a complementary sequential algorithm for solving sequence alignment problem on DNA (Deoxyribonucleic acid) molecules. The parallel algorithm is considered much faster than sequential algorithms used to perform sequence alignment; the initialization operation is done by activating a number of processing elements each compa...
متن کاملDynamic Programming for Protein Sequence Alignment
Dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. This idea is very insightful for solving bioinformatics problems. Aligning distantly related protein sequences is a long-standing problem in bioinformatics and a key for successful protein structure prediction. A fast and valid algorithm can benefit the whole process of biology research....
متن کاملA Fast Method for Linear Space Pairwise Sequence Alignment
Pairwise sequence alignment is an important technique for finding the optimal arrangement between two sequences. A basic dynamic-programming strategy for sequence alignment needs O(mn) time and also O(mn) space. Hirschberg’s divide-and-conquer method reduces the required space to roughly 2m (m ≤ n), but it also doubles the computing time. On the other hand, the FastLSA approach adds extra rows ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2015
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2015.060830